Automatic RANSAC by Likelihood Maximization

نویسندگان

چکیده

In computer vision, and particularly in 3D reconstruction from images, it is customary to be faced with regression problems contaminated by outlying data. The standard efficient method deal them the Random Sample Consensus (RANSAC) algorithm. procedure simple versatile, drawing random minimal samples data estimate parameterized candidate models ranking based on amount of compatible Such evaluation involves some threshold that separates inliers outliers. presence unknown level noise, as usual practice, desirable remove dependency this fixed an additional unknown. Among numerous variants RANSAC, few, we call 'automatic', propose approach, which changing maximization criterion consensus, naturally increasing varying threshold. An algorithm Zach Cohen (ICCV 2015) uses likelihood statistics. We present details implementation their along quantitative qualitative tests stereovision tasks: estimation homography, fundamental essential matrix.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical POMDP Controller Optimization by Likelihood Maximization

Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be framed as a non-convex optimization problem. However, the inherent computational difficulty of solving such an optimization problem makes it hard to scale to realworld problems. In another line of research, Toussaint ...

متن کامل

Non-monotonic Poisson Likelihood Maximization

This report summarizes the theory and some main applications of a new non-monotonic algorithm for maximizing a Poisson Likelihood, which for Positron Emission Tomography (PET) is equivalent to minimizing the associated Kullback-Leibler Divergence, and for Transmission Tomography is similar to maximizing the dual of a maximum entropy problem. We call our method non-monotonic maximum likelihood (...

متن کامل

MAP Estimation for Graphical Models by Likelihood Maximization

Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a mixture of simple Bayes nets. We ...

متن کامل

Scoring Conference Submissions by Alternate Maximization of Likelihood

We address the problem of combining the subjective, confidence-tagged opinions of experts that independently review a set of like items, such as submissions to a scientific conference. The conventional approach of confidence-weighted averaging is improved upon by augmenting a probabilistic error model with bias and trust parameters that characterize the subjectivity of the referees’ quality and...

متن کامل

Sentence Selection by Direct Likelihood Maximization for Language Model Adaptation

A general framework of language model task adaptation is to select documents in a large training set based on a language model estimated on a development data. However, this strategy has a deficiency that the selected documents are biased to the most frequent patterns in the development data. To address this problem, a new task adaptation method is proposed that selects documents in the trainin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Image Processing On Line

سال: 2022

ISSN: ['2105-1232']

DOI: https://doi.org/10.5201/ipol.2022.357